Increment Primes

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Increment Registers

We give an optimal wait free implementation of an increment register An increment register is a concurrent object consisting of an integer valued register with an increment operation that atomically increments the register and returns the previous value We implement this register in a synchronous message passing model with crash failures In our implementation an increment operation halts in O l...

متن کامل

Efficient Fetch-and-Increment

A Fetch&Inc object stores a non-negative integer and supports a single operation, fi, that returns the value of the object and increments it. Such objects are used in many asynchronous shared memory algorithms, such as renaming, mutual exclusion, and barrier synchronization. We present an efficient implementation of a wait-free Fetch&Inc object from registers and load-linked/store-conditional (...

متن کامل

Small Gaps between Primes or Almost Primes

Let pn denote the nth prime. Goldston, Pintz, and Yıldırım recently proved that lim inf n→∞ (pn+1 − pn) log pn = 0. We give an alternative proof of this result. We also prove some corresponding results for numbers with two prime factors. Let qn denote the nth number that is a product of exactly two distinct primes. We prove that lim inf n→∞ (qn+1 − qn) ≤ 26. If an appropriate generalization of ...

متن کامل

Catalan Numbers, Primes and Twin Primes

with C0 = 1. Their appearances occur in a dazzling variety of combinatorial settings where they are used to enumerate all manner of geometric and algebraic objects (see Richard Stanley’s collection [28, Chap. 6]; an online Addendum is continuously updated). Quite a lot is known about the divisibility of the Catalan numbers; see [2, 10]. They are obviously closely related to the middle binomial ...

متن کامل

Recognizing Primes

This is a survey article on primality testing and general methods for recognizing primes. We also look at methods for generating random primes since this is valuable in cryptographic methods such as the RSA cipher. Mathematics Subject Classification: Primary: 11A41; Secondary: 11A51

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: American Journal of Applied Mathematics and Statistics

سال: 2014

ISSN: 2328-7306

DOI: 10.12691/ajams-2-2-3